Basin Hopping Networks of continuous global optimization problems
نویسندگان
چکیده
منابع مشابه
Multicanonical basin hopping: a new global optimization method for complex systems.
We introduce a new optimization algorithm that combines the basin-hopping method, which can be used to efficiently map out an energy landscape associated with minima, with the multicanonical Monte Carlo method, which encourages the system to move out of energy traps during the computation. As an example of implementing the algorithm for the global minimization of a multivariable system, we cons...
متن کاملGlobal optimization of fractional posynomial geometric programming problems under fuzziness
In this paper we consider a global optimization approach for solving fuzzy fractional posynomial geometric programming problems. The problem of concern involves positive trapezoidal fuzzy numbers in the objective function. For obtaining an optimal solution, Dinkelbach’s algorithm which achieves the optimal solution of the optimization problem by means of solving a sequence of subproblems ...
متن کاملAn intelligent global harmony search approach to continuous optimization problems
Harmony search algorithm is a meta-heuristic optimization method imitating the music improvisation process, where musicians improvise their instruments’ pitches searching for a perfect state of harmony. To solve continuous optimization problems more efficiently, this paper presents an improved harmony search algorithm using the swarm intelligence technique. Applying the proposed algorithm to se...
متن کاملStudies on Metaheuristics for Continuous Global Optimization Problems
Preface The interface between computer science and operations research has drawn much attention recently especially in optimization which is a main tool in operations research. In optimization area, the interest on this interface has rapidly increased in the last few years in order to develop nonstandard algorithms that can deal with optimization problems which the standard optimization techniq...
متن کاملContinuous Reformulations of Discrete-Continuous Optimization Problems
This paper treats the solution of nonlinear optimization problems involving discrete decision variables, also known as generalized disjunctive programming (GDP) or mixed-integer nonlinear programming (MINLP) problems, that arise in process engineering. The key idea is to eliminate the discrete decision variables by adding a set of continuous variables and constraints that represent the discrete...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Central European Journal of Operations Research
سال: 2017
ISSN: 1435-246X,1613-9178
DOI: 10.1007/s10100-017-0480-0